Polyhedral representation conversion up to symmetries

نویسندگان

  • David Bremner
  • Mathieu Dutour Sikiric
  • Achill Schürmann
چکیده

We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of lower dimensional subproblems. These methods have been successfully used by different authors in special contexts. Moreover, we sketch an incremental method, which is a generalization of Fourier–Motzkin elimination, and we give some ideas how symmetry can be exploited using

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abstract Representation of Object and Structural Symmetries Detection

Representation of Object and Structural Symmetries Detection Vincent Dugat (IRIT-UPS, Toulouse, France [email protected]) Pierre Gambarotto (IRIT-UPS, Toulouse, France [email protected]) Yannick Larvor (IRIT-UPS, Toulouse, France [email protected]) Abstract: This paper describes a method for constructing an abstract representation of a shape from a classical polyhedral 3D representation of an object. This...

متن کامل

Complete Graphs whose Topological Symmetry Groups are Polyhedral

Characterizing the symmetries of a molecule is an important step in predicting its chemical behavior. Chemists have long used the group of rigid symmetries, known as the point group, as a means of representing the symmetries of a molecule. However, molecules which are flexible or partially flexible may have symmetries which are not included in the point group. Jon Simon [11] introduced the conc...

متن کامل

Non-redundant Graph Representation of Polyhedral Networks

Infinite homogeneous networks in crystal structures with a single kind of coordination polyhedron and a single kind of connection between polyhedra can be represented by so-called quotient graphs or direction-labeled graphs [1],[2]. These finite graphs may be obtained from periodic nets by graph folding based upon translational symmetries. Taking all given symmetries into account this folding c...

متن کامل

Shaded Rendering and Shadow Computation for Polyhedral Animation

In this paper we discuss an approach for solving the problem of rendering a shaded sequence of views of a polyhedral scene with shadows and with hidden surfaces removed. We concentrate specifically on the hidden surface problem, the computation of shadow regions, and video-rate display. The method relies on a precomputation phase which constructs the aspect representation, a representation whic...

متن کامل

Oblique Graphs

The main issue of this work is to investigate asymmetric structures in graphs. While symmetry structures in graphs are well observed, the opposite question has not been investigated deeply so far. It is known from a theorem of Wright, that almost all graphs are asymmetric. The class of asymmetric graphs is restricted further by forbidding even local symmetries. The main question is to determine...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/math/0702239  شماره 

صفحات  -

تاریخ انتشار 2007